Fault diameter of product graphs
نویسندگان
چکیده
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fault diameter of the product graph G1 ∗G2 of two graphs G1 and G2 and proves that Dk1+k2(G1 ∗G2) Dk1(G1)+Dk2(G2)+ 1 if G1 is k1-connected and G2 is k2-connected. This generalizes some known results such as Banič and Žerovnik [I. Banič, J. Žerovnik, Fault-diameter of Cartesian graph bundles, Inform. Process. Lett. 100 (2) (2006) 47–51]. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Edge fault - diameter of graph product ∗
The product graph B ∗ F of graphs B and F is an interesting model in the design of large reliable networks. Let G be a kG-edge connected graph and DE c (G) be the largest diameter of subgraphs of G obtained by deleting c < kG edges. We prove that DE a+b+1(B ? F ) ≤ DE a (F ) +DE b (B) + 1 where a < kF , and b < kB . Key–Words: product graph, edge-connectivity, edge fault-diameter, reliable inte...
متن کاملProduct-closed networks
We present a uniform mathematical characterization of interconnection network classes referred to as product-closed networks (PCN). A number of popular network classes fall under this characterization including binary hypercubes, tori, k-ary n-cubes, meshes, and generalized hypercubes. An unlimited number of other networks can be defined using the presented mathematical characterization. An imp...
متن کاملOn Vulnerability Measures of Networks
As links and nodes of interconnection networks are exposed to failures, one of the most important features of a practical networks design is fault tolerance. Vulnerability measures of communication networks are discussed including the connectivities, fault diameters, and measures based on HosoyaWiener polynomial. An upper bound for the edge fault diameter of product graphs is proved.
متن کاملFault-diameter of Cartesian product of graphs and Cartesian graph bundles
Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a kG-connected graph and Dc(G) denote the diameter of G after deleting any of its c < kG vertices. We prove that if G1, G2, . . . , Gq are k1connected, k2-connected,. . . , kq-connected graphs and 0 ≤ a1 < k1, 0 ≤ a2 < k2,. . . , 0 ≤ aq < kq and a = a1 + a2 + . . . + aq + (q − 1), the...
متن کاملWide Diameters of Cartesian Product Graphs and Digraphs
In graph theory and study of fault tolerance and transmission delay of networks, connectivity and diameter of a graph are two very important parameters and have been deeply studied by many authors. Wide diameter combining connectivity with diameter is a more important parameter to measure fault tolerance and efficiency of parallel processing computer networks and has received much attention in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 102 شماره
صفحات -
تاریخ انتشار 2007